Flexible subspace iteration with moments for an effective contour integration?based eigensolver

نویسندگان

چکیده

Contour integration schemes are a valuable tool for the solution of difficult interior eigenvalue problems. However, many large linear systems with multiple right hand sides may prove prohibitive computational expense. The number sides, and thus, cost be reduced if projected subspace is created using moments. In this work, we explore heuristics choice application moments respect to various other important parameters in contour scheme. We provide evidence expected performance, accuracy, robustness schemes, showing that good heuristic choices can scheme featuring properties all three these measures.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Subspace Iteration on Steroids – A New Highly Parallel Non-Hermitian Eigensolver

Calculating portions of eigenvalues and eigenvectors of matrices or matrix pencils has many applications. An approach to this calculation for Hermitian problems based on a density matrix has been proposed in 2009 and a software package called FEAST has been developed. The density-matrix approach allows FEAST’s implementation to exploit a key strength of modern computer architectures, namely, mu...

متن کامل

An Accelerated Subspace Iteration Method

The analysis of a number of physical phenomena requires the solution of an eigenproblem. It is therefore natural that with the increased use of computational methods operating on discrete representations of physical problems the development of efficient algorithms for the calculation of eigenvalues and eigenvectors has attracted much attention [l]-[8]. In particular, the use of finite element a...

متن کامل

A New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems

In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.

متن کامل

FEAST As A Subspace Iteration Eigensolver Accelerated By Approximate Spectral Projection

The calculation of a segment of eigenvalues and their corresponding eigenvectors of a Hermitian matrix or matrix pencil has many applications. A new density-matrix-based algorithm has been proposed recently and a software package FEAST has been developed. The density-matrix approach allows FEAST’s implementation to exploit a key strength of modern computer architectures, namely, multiple levels...

متن کامل

Subspace Iteration for Eigenproblems

We discuss a novel approach for the computation of a number of eigenvalues and eigenvectors of the standard eigenproblem Ax = x. Our method is based on a combination of the Jacobi-Davidson method and the QR-method. For that reason we refer to the method as JDQR. The eeectiveness of the method is illustrated by a numerical example.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Numerical Linear Algebra With Applications

سال: 2022

ISSN: ['1070-5325', '1099-1506']

DOI: https://doi.org/10.1002/nla.2447